Quality assessment of nonlinear dimensionality reduction based on K-ary neighborhoods
نویسندگان
چکیده
Nonlinear dimensionality reduction aims at providing low-dimensional representions of high-dimensional data sets. Many new methods have been recently proposed, but the question of their assessment and comparison remains open. This paper reviews some of the existing quality measures that are based on distance ranking and K-ary neighborhoods. In this context, the comparison of the ranks in the highand low-dimensional spaces leads to the definition of the co-ranking matrix. Rank errors and concepts such as neighborhood intrusions and extrusions can be associated with different blocks of the co-ranking matrix. The considered quality criteria are then cast within this unifying framework and the blocks they involve are identified. The same framework allows us to propose simpler criteria, which quantify two aspects of the embedding, namely its overall quality and its tendency to favor either intrusions or extrusions. Eventually, a simple experiment illustrates the soundness of the approach.
منابع مشابه
Rank-based quality assessment of nonlinear dimensionality reduction
Nonlinear dimensionality reduction aims at providing lowdimensional representions of high-dimensional data sets. Many new methods have been proposed in the recent years, but the question of their assessment and comparison remains open. This paper reviews some of the existing quality measures that are based on distance ranking and K-ary neighborhoods. Many quality criteria actually rely on the a...
متن کاملQuality assessment of dimensionality reduction: Rank-based criteria
Dimensionality reduction aims at providing low-dimensional representations of high-dimensional data sets. Many new nonlinear methods have been proposed for the last years, yet the question of their assessment and comparison remains open. This paper first reviews some of the existing quality measures that are based on distance ranking and K-ary neighborhoods. Next, the definition of the corankin...
متن کاملNonlinear dimensionality reduction of data manifolds with essential loops
Numerous methods or algorithms have been designed to solve the problem of nonlinear dimensionality reduction (NLDR). However, very few among them are able to embed efficiently ‘circular’ manifolds like cylinders or tori, which have one or more essential loops. This paper presents a simple and fast procedure that can tear or cut those manifolds, i.e. break their essential loops, in order to make...
متن کاملDiscrete Hessian Eigenmaps method for dimensionality reduction
For a given set of data points lying on a low-dimensional manifold embedded in a high-dimensional space, the dimensionality reduction is to recover a low-dimensional parametrization from the data set. The recently developed Hessian Eigenmaps is a mathematically rigorous method that also sets a theoretical framework for the nonlinear dimensionality reduction problem. In this paper, we develop a ...
متن کاملQuality Assessment for Nonlinear Dimensionality Reduction using Procrustes Analysis
In order to achieve of PNL-ICA (Post-Nonlinear Independent Component Analysis) by using Dimensionality Reduction [1] the data set has to be embedded in a hyperplane, i.e. linear combination of the latent variables. This condition must be fulfilled in order to ensure that there is an unique solution to the problem. This article describes a new quality measure for Nonlinear Dimensionality Reducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008